//#pragma comment(linker,"/STACK:16777216") /*16Mb*/
//#pragma comment(linker,"/STACK:33554432") /*32Mb*/
#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<numeric>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<memory>
#include<string>
#include<vector>
#include<cctype>
#include<list>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;

typedef unsigned long long      ui64;
typedef long long               i64;
typedef	vector<int>             VI;
typedef	vector<bool>            VB;
typedef	vector<VI>              VVI;
typedef	vector<string>          VS;
typedef	pair<int,int>           PII;
typedef map<string,int>         MSI;
typedef set<int>                SI;
typedef set<string>             SS;
typedef map<int,int>            MII;
typedef	pair<double,double>     PDD;

#define PB                      push_back
#define MP                      make_pair
#define X                       first
#define Y                       second
#define FOR(i, a, b)            for(int i = (a); i < (b); ++i)
#define RFOR(i, a, b)           for(int i = (a) - 1; i >= (b); --i)
#define CLEAR(a, b)             memset(a, b, sizeof(a))
#define SZ(a)                   int((a).size())
#define ALL(a)                  (a).begin(), (a).end()
#define RALL(a)                 (a).rbegin(), (a).rend()
#define INF                     (2000000000)


string il = "window";
string pr = "aisle";
string nr = "neither";

string prem(char c) {
	if(c=='A' || c=='D') return il;
	return pr;
}

string biz(char c) {
	if(c=='A' || c=='F') return il;
	return pr;
}

string norm(char c) {
	if(c=='A' || c=='K') return il;
	if(c=='C' || c=='D' || c=='G' || c=='H') return pr;
	return nr;
}

string solve(int row, char c) {
	if(row<3)
		return prem(c);
	if(row<21)
		return biz(c);
	return norm(c);
}

int main()
{
	string s;
	while(cin >> s) {
		string num = s.substr(0,SZ(s)-1);
		int place = atoi(s.c_str());
		//cout << s.back() << " " << place << endl;
		cout << solve(place,s[SZ(s)-1]) << endl;
	}
    return 0;
}